Verifying the Uniform Candy Distribution Puzzle with CSP-Prover
نویسندگان
چکیده
In this paper we formally verify that the Uniform Candy Distribution Puzzle is self-stabilizing: Given a valid start configuration, eventually the Puzzle will evolve to a ‘stable’ situation in which it will remain. In terms of verification, the Uniform Candy Distribution Puzzle forms a scalable parametrized distributed system: The Puzzle comes in various sizes, for each size of the Puzzle there are infinitely many valid start configurations, the Puzzle evolves following local rule applications. We describe how to model the Uniform Candy Distribution Puzzle in the process algebra CSP, give a mathematical argument for its self-stabilizing property, and formalize the proof with the interactive theorem prover CSP-Prover.
منابع مشابه
Embedding CSP in PVS. An Application to Authentication Protocols
In [28], Schneider applies CSP to the modelling and analysis of authentication protocols and develops a general proof strategy for verifying authentication properties. This paper shows how the PVS theorem prover can provide e ective mechanical support to the approach.
متن کاملAn Improved HHL Prover: An Interactive Theorem Prover for Hybrid Systems
Hybrid systems are integrations of discrete computation and continuous physical evolution. To guarantee the correctness of hybrid systems, formal techniques on modelling and verification of hybrid systems have been proposed. Hybrid CSP (HCSP) is an extension of CSP with differential equations and some forms of interruptions for modelling hybrid systems, and Hybrid Hoare logic (HHL) is an extens...
متن کاملAnalysing Time Dependent Security Properties in CSP Using PVS
This paper details an approach to verifying time dependent authen tication properties of security protocols We discuss the introduction of time into the Communicating Sequential Processes CSP protocol veri cation framework of The embedding of CSP in the theorem prover PVS Prototype Veri cation System is extended to incorporate event based time retaining the use of the existing rank function app...
متن کاملA Complete Axiomatic Semantics for the CSP Stable-Failures Model
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been given in operational style. A Csp semantics in axiomatic style, however, has been considered problematic in the literature. In this paper we present a sound and complete axiomatic semantics for Csp with unbounded nondet...
متن کاملProof Principles of CSP – CSP-Prover in Practice
The process algebra Csp provides a well-established formalism for the modelling, analysis, and verification of concurrent systems. Besides being a specification language, Csp provides a valuable set of proof principles. We show in tutorial style, how these proof principles are made available in our tool Csp-Prover. Overall, Csp-Prover turns out to be an off-the-shelf proof tool ready for use in...
متن کامل